Scalar Tagged PN Triangles

نویسندگان

  • Tamy Boubekeur
  • Patrick Reuter
  • Christophe Schlick
چکیده

This paper presents a new technique to convert a coarse polygonal geometric model into a smooth surface interpolating the mesh vertices, by improving the principle proposed by Vlachos et al. in their "Curved PN-Triangles". The key idea is to assign to each mesh vertex, a set of three scalar tags that act as shape controllers. These scalar tags (called sharpness, bias, and tension) are used to compute a procedural displacement map that enriches the geometry, and a procedural normal map that enriches the shading. The resulting technique offers two majors features: first, it can be applied on meshes of arbitrary topology while always generating surfaces with consistent behaviors across edge and vertex boundaries, second, it only involves operations that are purely local to each polygon, which means that it is very well suited for hardware implementations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Flipping Edges in Triangulations of Point Sets, Polygons and Maximal Planar Graphs

A triangulation of a point set Pn is a partitioning of the convex hull Conv (Pn) into a set of triangles with disjoint interiors such that the vertices of these triangles are in Pn, and no element of Pn lies in the interior of any of these triangles. An edge e of a triangulation T is called flippable if it is contained in the boundary of two triangles of T , and the union of these triangles for...

متن کامل

On the Kähler Classes of Constant Scalar Curvature Metrics on Blow Ups

Problem 1.1. Given a compact constant scalar curvature Kähler manifold (M,J, g, ω), of complex dimension m := dimC M , and having defined △ := {(p1, . . . , pn) ∈ M n : ∃ a 6= b pa = pb}, characterize the set PW = {(p1, . . . , pn, α1, . . . , αn)} ⊂ (M n \ △) × (0,+∞) for which M̃ = Blp1,...,pnM , the blow up of M at p1, . . . , pn has a constant scalar curvature Kähler metric (cscK from now on...

متن کامل

A Remark on Partitions and Triangles

Let C be a circle divided into n parts equally. S = {P0, P1, . . . , Pn−1} denotes the set of the ends of these parts on C. Let C3(n) be the number of incongruent triangles inscribed in C, where the vertices of the triangles are chosen from S. In this note, we shall show a relation between the number C3(n) and the partitions into at most three parts. 2000 Mathematics Subject Classification. Pri...

متن کامل

Barycentric Mappings

As in the previous chapter, let us denote points in R by p = (x, y, z) and points in R by u = (u, v). An edge is then defined as the convex hull of (or, equivalently, the line segment between) two distinct points and a triangle as the convex hull of three non-collinear points. We will denote edges and triangles in R with capital letters and those in R with small letters, for example, e = [u1,u2...

متن کامل

Similar Triangles, Another Trace of the Golden Ratio

In this paper we investigate similar triangles which are not congruent but have two pair congruent sides. We show that greatest lower bound of values for similarity ratio of such triangles is golden ratio. For right triangles, we prove that the supremum of values for similarity ratio is the square root of the golden ratio.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005